منابع مشابه
Modifications of Competitive Group Testing
Many fault-detection problems fall into the following model: There is a set of n items, some of which are defective. The goal is to identify the defective items by using the minimum number of tests. Each test is on a subset of items and tells whether the subset contains a defective item or not. Let Ma(d, n)(M(d In)) denote the maximum number of tests for an algorithm ot to identify d defectives...
متن کاملA New Competitive Algorithm for Group Testing
Algorithms for the group testing problem when there is no a priori information on the number of defective items are considered. The efficiency criterion used is the competitive ratio, which is the ratio of the number of tests required by an algorithm when there is no a priori information on the number of defective items, to the number of tests required by an optimal algorithm when the number of...
متن کاملNew Constructions for Competitive and Minimal-Adaptive Group Testing
Group testing (GT) was originally proposed during the World War II in an attempt to minimize the cost and waiting time in performing identical blood tests of the soldiers for a low-prevalence disease. Formally, the GT problem asks to find d n defective elements out of n elements by querying subsets (pools) for the presence of defectives. By the information-theoretic lower bound, essentially d l...
متن کاملCompetitive Closeness Testing
We test whether two sequences are generated by the same distribution or by two different ones. Unlike previous work, we make no assumptions on the distributions’ support size. Additionally, we compare our performance to that of the best possible test. We describe an efficiently-computable algorithm based on pattern maximum likelihood that is near optimal whenever the best possible error probabi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1993
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90011-c